A Hybrid Genetic Algorithm with Perturbation for the Multi-depot Capacitated Arc Routing Problem
نویسندگان
چکیده
منابع مشابه
capacitated multi-depot vehicle routing problem with inter-depot routes
in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...
متن کاملModel and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand
The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...
متن کاملA Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem
Recently proved successful for variants of the vehicle routing problem (VRP) involving time windows, genetic algorithms have not yet shown to compete or challenge current best search techniques in solving the classical capacitated VRP. In this paper, a hybrid genetic algorithm to address the capacitated vehicle routing problem is proposed. The basic scheme consists in concurrently evolving two ...
متن کاملA Hybrid GRASPxVNS Algorithm with Effective Depot Reduction Mechanism for the Capacitated Location Routing Problem
In this paper, we propose a new hybrid heuristic to solve the Location Routing Problem with capacitated depots and capacitated vehicles. The heuristic combines a Greedy Randomized Adaptive Search Procedure to determine the depot locations to be established and a Variable Neighborhood Search to optimize the vehicle routes originating at the opened depots. Furthermore, we enhance the heuristic by...
متن کاملA hybrid metaheuristic approach for the capacitated arc routing problem
The capacitated arc routing problem (CARP) is a difficult combinatorial optimization problem that has been intensively studied in the last decades. We present a hybrid metaheuristic approach (HMA) to solve this problem which incorporates an effective local refinement procedure, coupling a randomized tabu thresholding procedure with an infeasible descent procedure, into the memetic framework. Ot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2013
ISSN: 1812-5654
DOI: 10.3923/jas.2013.3239.3244